The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search
نویسندگان
چکیده
منابع مشابه
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملReactive Tabu Search and Variable Neighbourhood Descent Applied to the Vehicle Routing Problem with Backhauls
We are in the presence of the VRP with backhauls, also known as the linehaul-backhaul problem, when the vehicles are not only required to deliver goods to customers, but also to pick up goods at customers locations. An example of this partition of the set of customers could be the grocery industry. The supermarkets and shops are the linehaul customers and the grocery suppliers are the backhaul ...
متن کاملSolving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملGreedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem
This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible. Given an undirected labelled connected graph, the minimum labelling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. This problem has been shown to be NP-hard. A Greedy Random...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2017
ISSN: 0191-2615
DOI: 10.1016/j.trb.2017.04.003